Some Complexity Results in the Design of Deadlock-Free Packet Switching Networks
نویسندگان
چکیده
Deadlocks are very serious system failures and have been observed in existing packet switching networks (PSN's). Several problems related to the design of deadlock-free PSN's are investigated here. Polynomial-time algorithms are given for some of these problems, but most of them are shown to be NP-complete or NP-hard, and therefore polynomial-time algorithms are not likely to be found.
منابع مشابه
A Necessary and Sufficient Condition for Deadlock-Free Routing in Cut-Through and Store-and-Forward Networks
This paper develops the theoretical background for the design of deadlock-free adaptive routing algorithms for virtual cut-through and store-and-forward switching. This theory is valid for networks using either central buffers or edge buffers. Some basic definitions and three theorems are proposed, developing conditions to verify that an adaptive algorithm is deadlock-free, even when there are ...
متن کاملModeling Soft State Protocols with SDL
Soft state provides new services to packet-switching networks by introducing a type of state in the network nodes which is refreshed by periodical messages and otherwise expires. The operations of soft state protocols, which are being designed with ever greater complexity, need to be error-free and deadlock-free to avoid misusing network resources. Thus, verification, formal analysis and valida...
متن کاملA new evaluation criterion for Clos- and Benes-type rearrangeable switching networks
An extended comparison and a classification of the control algorithms for rearrangeable switching networks is tried in this study. Besides of the failure probability Pf a new evaluation criterion is introduced, the mean number of rearranges Rm the network performs in order to satisfy incoming calls. A simulation comparison for eight control algorithms concerning clos-type networks and networks ...
متن کاملDeadlock-free Multicast Wormhole Routing in Multicomputer Networks Deadlock-free Multicast Wormhole Routing in Multicomputer Networks
EEcient routing of messages is the key to the performance of multicomputers. Mul-ticast communication refers to the delivery of the same message from a source node to an arbitrary number of destination nodes. Wormhole routing is the most promising switching technique used in new generation multicomputers. In this paper, we present multicast wormhole routing methods for multicomputers adopting 2...
متن کاملA Simple Incremental Network Topology for Wormhole Switch-Based Networks
Wormhole switching has become the most widely used switching technique for multicomputers. However, the main drawback of wormhole switching is that blocked messages remain in the network, prohibiting other messages from using the occupied links and buffers. To address the deadlock problem without compromising communication latency and the incremental expansion capability that irregular networks...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- SIAM J. Comput.
دوره 10 شماره
صفحات -
تاریخ انتشار 1981